Stretching technique for obtaining global minimizers through Particle Swarm Optimization
نویسندگان
چکیده
The Particle Swarm Optimizer, like many other evolutionary and classical minimization methods, su ers the problem of occasional convergence to local minima, especially in multimodal and scattered landscapes. In this work we propose a modi cation of the Particle Swarm Optimizer that makes use of a new technique, named Function \Stretching", to alleviate the local minima problem. Function \Stretching" consists of a two{stage transformation of the objective function that eliminates local minima, while preserving global ones. Experiments indicate that the Particle Swarm Optimizer equipped with the \Stretching" technique exhibits good performance and results in nding global minima reliably and predictably.
منابع مشابه
Computing Nash Equilibria through Particle Swarm Optimization
This paper considers the application of a novel optimization method, namely Particle Swarm Optimization, to compute Nash equilibria. The problem of computing equilibria is formed as one of detecting the global minimizers of a real-valued, nonnegative, function. To detect more than one global minimizers of the function at a single run of the algorithm and address effectively the problem of local...
متن کاملRecent Advances in Fuzzy Cognitive Maps Learning Using Evolutionary Computation Techniques
A recently proposed swarm intelligence technique for Fuzzy Cognitive Map learning is described. The technique employs the Particle Swarm Optimization algorithm to minimize a proper objective function, whose global minimizers correspond to suboptimal weight matrices of the Fuzzy Cognitive Map. New instances of an industrial test problem are studied, justifying the usefulness of the technique as ...
متن کاملImproving the Particle Swarm Optimizer by Function “stretching”
In this paper a new technique, named Function “Stretching”, for the alleviation of the local minima problem is proposed. The main feature of this technique is the usage of a two–stage transformation of the objective function to eliminate local minima, while preserving the global ones. Experiments indicate that combined with the Particle Swarm Optimizer method, the new algorithm is capable of es...
متن کاملChapter 3 IMPROVING THE PARTICLE SWARM OPTIMIZER BY FUNCTION “STRETCHING”
In this paper a new technique, named Function “Stretching”, for the alleviation of the local minima problem is proposed. The main feature of this technique is the usage of a two–stage transformation of the objective function to eliminate local minima, while preserving the global ones. Experiments indicate that combined with the Particle Swarm Optimizer method, the new algorithm is capable of es...
متن کاملA Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network
Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...
متن کامل